Drawing c-planar biconnected clustered graphs
نویسندگان
چکیده
منابع مشابه
Planar Drawing of Clustered Graphs
Graphs are often used to represent relational information. As the amount of information that we want to visualize becomes larger and more complicated, classical graph model tends to be insuucient. In this paper, we introduce and show how to draw a practical and simple graph structure known as clustered graphs. We present an algorithm which produces planar, straight-line, convex drawings of clus...
متن کاملSurvey on Planar Drawing of Clustered Graphs
In recent years, there has been great interest in graph drawing to express relational information and applications range from CASE tools, reverse engineering, idea organization, and software design. However, as the graphs to be visualized become more and more complex, extended structured graph variations are needed. Clustered graphs are graphs with recursive clustering structures. The possible ...
متن کاملDrawing Planar Clustered Graphs in 2.5 Dimensions
Clustering techniques have proven to be useful in reducing the complexity of large networks. We present a method for drawing a clustered graph in 2.5D, given the clusters of the graph are connected in a planar way. The main contribution is to develop a weighted version of the well known 2D straight line drawing algorithm of de Fraysseix, Pach and Pollack [5] for planar graphs. This version allo...
متن کاملSampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the exact number of rooted 2-connected planar graphs, based on a decomposition along the connectivity structure. For 3-connected planar graphs we use the fact that they have a unique embedding on the sphere. Special care h...
متن کاملBitonic st-orderings of Biconnected Planar Graphs
Vertex orderings play an important role in the design of graph drawing algorithms. Compared to canonical orderings, st-orderings lack a certain property that is required by many drawing methods. In this paper, we propose a new type of st-ordering for biconnected planar graphs that relates the ordering to the embedding. We describe a linear-time algorithm to obtain such an ordering and demonstra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.04.044